Hybrid linear logic, revisited
نویسندگان
چکیده
منابع مشابه
Bounded Linear Logic, Revisited
We present QBAL, an extension of Girard, Scedrov and Scott’s bounded linear logic. The main novelty of the system is the possibility of quantifying over resource variables. This generalization makes bounded linear logic considerably more flexible, while preserving soundness and completeness for polynomial time. In particular, we provide compositional embeddings of Leivant’s RRW and Hofmann’s LF...
متن کاملStochastic Reasoning in Hybrid Linear Logic
Ordinary linear implication can represent unconstrained state transition, but stateful systems often operate under temporal and stochastic constraints which impede the use of linear logic as a framework for representing stateful computations. We propose a general modal extension of linear logic where the worlds represent the constraints, and hybrid connectives combine constraint reasoning with ...
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملLinear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملA Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation
Bellin, G. and J. Ketonen, A decision procedure revisited: Notes on direct logic, linear logic and its implementation, Theoretical Computer Science 95 (1992) 115-142. This paper studies decidable fragments of predicate calculus. We will focus on the structure of direct predicate calculus as defined in Ketonen and Weyhrauch (1984) in the light of the recent work of Girard (Girard 1987, 1988) on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2019
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129518000439